Then a suboptimal solution of the graph maximum equal - cut problem is presented employing the randomized algorithm and the improved coordinate ascent ( descent ) algorithm on the optimal solution of semidefmite relaxation 在利用lagrange乘子理论得出原始问题的等价形式之后,将近似算法与改进的坐标上升(下降)算法结合,求得原问题的次优解。